Communication Complexity and Mechanism Design

نویسنده

  • Timothy Van Zandt
چکیده

The curse of the Revelation Principle is that it leads us to focus on unrealistic mechanisms in which agents report all private information to the principal, who then makes all decisions centrally. This is not true when communication costs are introduced. Then partial communication of information, sequential back-and-forth conversations, and decentralization of decisions become part of optimal mechanisms. This paper looks at the interplay between the incentive constraints and the communication constraints. When can they be separated, so that e.g. one can separately study the incentive compatibility of a social choice rule and the minimum-cost communication protocol that realizes the social choice rule? (JEL: D82, C72)

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Design of a novel congestion-aware communication mechanism for wireless NoC architecture in multicore systems

Hybrid Wireless Network-on-Chip (WNoC) architecture is emerged as a scalable communication structure to mitigate the deficits of traditional NOC architecture for the future Multi-core systems. The hybrid WNoC architecture provides energy efficient, high data rate and flexible communications for NoC architectures. In these architectures, each wireless router is shared by a set of processing core...

متن کامل

Computational Mechanism Design

Computational mechanism design brings together the concern in microeconomics with decision making in the context of distributed private information and self-interest and the concern in computer science with computational and communication complexity. In constructing mechanisms, with application to the design of electronic markets and to protocols for automated negotiation, many new issues arise...

متن کامل

Computational Mechanism Design

Computational mechanism design brings together the concern in microeconomics with decision making in the context of distributed private information and self-interest and the concern in computer science with computational and communication complexity. In constructing mechanisms, with application to the design of electronic markets and to protocols for automated negotiation, many new issues arise...

متن کامل

Connections, Communication and Collaboration in Healthcare’s Complex Adaptive Systems; Comment on “Using Complexity and Network Concepts to Inform Healthcare Knowledge Translation”

A more sophisticated understanding of the unpredictable, disorderly and unstable aspects of healthcare organisations is developing in the knowledge translation (KT) literature. In an article published in this journal, Kitson et al introduced a new model for KT in healthcare based on complexity theory. The Knowledge Translation Complexity Network Model (KTCNM) provides a fresh perspective by mak...

متن کامل

An Efficient LUT Design on FPGA for Memory-Based Multiplication

An efficient Lookup Table (LUT) design for memory-based multiplier is proposed.  This multiplier can be preferred in DSP computation where one of the inputs, which is filter coefficient to the multiplier, is fixed. In this design, all possible product terms of input multiplicand with the fixed coefficient are stored directly in memory. In contrast to an earlier proposition Odd Multiple Storage ...

متن کامل

Design of cybernetic metamodel of cryptographic algorithms and ranking of its supporting components using ELECTRE III method

Nowadays, achieving desirable and stable security in networks with national and organizational scope and even in sensitive information systems, should be based on a systematic and comprehensive method and should be done step by step. Cryptography is the most important mechanism for securing information. a cryptographic system consists of three main components: cryptographic algorithms, cryptogr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007